Single pass kernel k-means clustering method

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Kernel Clustering: Approximate Kernel k-means

Kernel-based clustering algorithms have the ability to capture the non-linear structure in real world data. Among various kernel-based clustering algorithms, kernel k -means has gained popularity due to its simple iterative nature and ease of implementation. However, its run-time complexity and memory footprint increase quadratically in terms of the size of the data set, and hence, large data s...

متن کامل

Fast, single-pass K-means algorithms

We discuss the issue of how well K-means scales to large databases. We evaluate the performance of our implementation of a scalable variant of K-means, from Bradley, Fayyad and Reina (1998b), that uses several, fairly complicated, types of compression to t points into a xed size buuer, which is then used for the clustering. The running time of the algorithm and the quality of the resulting clus...

متن کامل

Kernel Penalized K-means: A feature selection method based on Kernel K-means

Article history: Received 11 June 2014 Received in revised form 23 October 2014 Accepted 11 June 2015 Available online 19 June 2015

متن کامل

Hartigan's Method: k-means Clustering without Voronoi

Hartigan’s method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuristic, one leading to a number of consistency properties, the other showing that the data partition is always quite separated from the induced Voronoi partition. A characterization of the volume of this separation is provide...

متن کامل

Consensus Kernel K-Means Clustering for Incomplete Multiview Data

Multiview clustering aims to improve clustering performance through optimal integration of information from multiple views. Though demonstrating promising performance in various applications, existing multiview clustering algorithms cannot effectively handle the view's incompleteness. Recently, one pioneering work was proposed that handled this issue by integrating multiview clustering and impu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sadhana

سال: 2013

ISSN: 0256-2499,0973-7677

DOI: 10.1007/s12046-013-0143-3